Random generation of DFAs
نویسندگان
چکیده
منابع مشابه
Random generation of DFAs
This document gives a generalization on the alphabet size of themethod that is described inNicaud’s thesis for randomly generating complete DFAs. First, we recall some properties of m-ary trees and we give a bijection between the set of m-ary trees and the set K(m,n) of generalized tuples. We show that this bijection can be built on any total prefix order on . Then we give the relations that ex...
متن کاملThe state complexity of random DFAs
The state complexity of a Deterministic Finite-state automaton (DFA) is the number of states in its minimal equivalent DFA. We study the state complexity of random n-state DFAs over a k-symbol alphabet, drawn uniformly from the set [n] × 2 of all such automata. We show that, with high probability, the latter is αkn + O( √ n log n) for a certain explicit constant αk.
متن کاملRandom DFAs over a Non-Unary Alphabet
This document gives a generalization on the alphabet size of the method that is described in Nicaud’s thesis for randomly generating complete DFAs. First we recall some properties of m-ary trees and we give a bijection between the set of m-ary trees and the set (m,n) of generalized n-tuples. We show that this bijection can be built on any prefix total order on Σ. Then we give the relations that...
متن کاملMinimization of Acyclic DFAs
There exists a linear time algorithm for the minimization of acyclic deterministic finite-state automata (ADFA) due to Dominique Revuz [17]. The algorithm has different phases involving the computation of a height for each state, sorting states of the same height and joining equivalent states. We present a new linear time algorithm for the task at hand. The algorithm is conceptionally simpler a...
متن کاملPartial Word DFAs
Recently, Dassow et al. connected partial words and regular languages. Partial words are sequences in which some positions may be undefined, represented with a “hole” symbol . If we restrict what the symbol can represent, we can use partial words to compress the representation of regular languages. Doing so allows the creation of so-called -DFAs which are smaller than the DFAs recognizing the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.03.072